Optimal threshold policies in a two-class preemptive priority queue with admission and termination control
نویسندگان
چکیده
We consider a two-class M " A2 IMI'11 preemptive priority queue in which there are two essential on-line decisions that have to be taken. The first is the decision to either accept or reject new type-lor type-2 jobs. The second is the decision to abort jobs, i.e., to remove any type-lor type-2 jobs from the system. We show that there exist optimal threshold policies for these two types of decisions.
منابع مشابه
Optimal threshold policies in a two-class preemptive priority queue with admission and termination control
We consider a two-class M " A2 IMI'11 preemptive priority queue in which there are two essential on-line decisions that have to be taken. The first is the decision to either accept or reject new type-lor type-2 jobs. The second is the decision to abort jobs, i.e., to remove any type-lor type-2 jobs from the system. We show that there exist optimal threshold policies for these two types of decis...
متن کاملA Queue-Length Cutoff Model for a Preemptive Two-Priority M/M/1 System
Abstract. We consider a two-priority, preemptive, single-server queueing model. Each customer is classified into either a high priority class or a low priority class. The arrivals of the two priority classes follow independent Poisson processes and service time is assumed to be exponentially distributed. A queue-length-cutoff method is considered. Under this discipline the server responds only ...
متن کاملOn Finite Queue with Two Types of Failures and Preemptive Priority (RESEARCH NOTE)
We study the single server queueing system with two types of Abstract failure to servicechannels including the preemptive priority to the repair of major failure. The units arrive at thesystem in a poisson fashion and are served exponenitally. The steady - state probabilities ofvarious states by using generating function have been obtained.
متن کاملEffects of Different Priority Policies on the Capacity Design for Multiclass
We consider an IvI Ilv!1 c queue with two classes of customers. We examine the effect of different priority policies on the optimal number of servers to minimize the long-run expected average server and holding costs of the system. Three different policies are considered; the non-idling non-preemptive and preemptive policies as well as the idling policy which minimizes the long-run expected ave...
متن کاملOptimal Policies for Multi-server Non-preemptive Priority Queues
We consider a multi-server non-preemptive queue with high and low priority customers, and a decision maker who decides when waiting customers may enter service. The goal is to minimize the mean waiting time for high-priority customers while keeping the queue stable. We use a linear programming approach to find and evaluate the performance of an asymptotically optimal policy in the setting of ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Queueing Syst.
دوره 54 شماره
صفحات -
تاریخ انتشار 2006